Approximate convex hull of affine iterated function system attractors
نویسندگان
چکیده
In this paper, we present an algorithm to construct an approximate convex hull of the attractors of an affine iterated function system (IFS). We construct a sequence of convex hull approximations for any required precision using the self-similarity property of the attractor in order to optimize calculations. Due to the affine properties of IFS transformations, the number of points considered in the construction is reduced. The time complexity of our algorithm is a linear function of the number of iterations and the number of points in the output convex hull. The number of iterations and the execution time increases logarithmically with increasing accuracy. In addition, we introduce a method to simplify the approximation of the convex hull without loss of accuracy.
منابع مشابه
Canonical Self - Affine Tilings
An iterated function system Φ consisting of contractive affine mappings has a unique attractor F ⊆ R which is invariant under the action of the system, as was shown by Hutchinson [Hut]. This paper shows how the action of the function system naturally produces a tiling T of the convex hull of the attractor. These tiles form a collection of sets whose geometry is typically much simpler than that ...
متن کاملOn Intersecting IFS Fractals with Lines
IFS Fractals the attractors of Iterated Function Systems in Euclidean space have motivated plenty of investigation to date, due to their simplicity and applicability in various fields, such as the modeling of plants in computer graphics, and the design of fractal antennas. The statement and resolution of the Fractal-Line Intersection Problem is imperative for a more efficient treatment of appli...
متن کاملAnalysis of the convex hull of the attractor of an IFS
In this paper we will introduce the methodology of analysis of the convex hull of the attractors of iterated functional systems (IFS) compact fixed sets of self-similarity mapping: K = ⋃ i=1..n Ai(K) + ti (1) where Ai are some contracting, linear mappings. The method is based on a function which for a direction, gives width in that direction. We can write the self similarity equation in terms o...
متن کاملA novel software application for interactive affine transformations of fractals
The paper presents a novel interactive application created in the C# programming language under the Microsoft Visual Studio environment: its introduction, theoretical grounds and application. The application allows generating two-dimensional fractals defined by iterated function systems and performing their arbitrary affine transformation. Most importantly, this transformations are easily contr...
متن کاملDimensions of self-affine fractals and multifractals generated by upper-triangular matrices
We consider calculation of the dimensions of self-affine fractals and multifractals that are the attractors of iterated function systems specified in terms of upper triangular matrices. Using methods from linear algebra we obtain explicit formulae for the dimensions that are valid in many cases.
متن کامل